Reasoning in a Restricted Temporal Logic
نویسندگان
چکیده
منابع مشابه
A Temporal Description Logic for Reasoning
A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expre...
متن کاملMeta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequent refers to the present and the future, then formulae that have their antecedent satisfied can be satisfied by considering the consequent as an imperative to be obeyed. Such a language becomes a natural alternative to ...
متن کاملReasoning in Interval Temporal Logic bY
Predicate logic is a powerful and general descriptive formalism with a long history of development. However, since the logic’s underlying semantics have no notion of time, statemebs such as “I increases by 2” cannot be directly expressed. We discuss interval temporal logic (ITL), f a ormalism that augments standard predicate logic with operators for time-dependent concepts. Our earlier work use...
متن کاملTemporal Reasoning in Propositional Interval Neighborhood Logic
Interval-based temporal reasoning is an important field of various areas of Computer Science and Artificial Intelligence, such as planning and natural language processing. In this paper we show that the satisfiability problem for one of the most important formalisms for interval-based reasoning, namely Allen’s Interval Algebra, can be reduced to the satisfiability problem for Propositional Neig...
متن کاملFast(er) Reasoning in Interval Temporal Logic
Clausal forms of logics are of great relevance in Artificial Intelligence, because they couple a high expressivity with a low complexity of reasoning problems. They have been studied for a wide range of classical, modal and temporal logics to obtain tractable fragments of intractable formalisms. In this paper we show that such restrictions can be exploited to lower the complexity of interval te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1993
ISSN: 0890-5401
DOI: 10.1006/inco.1993.1006